On the Bounded Partition Dimension of Some Generalised Graph Structures
نویسندگان
چکیده
Consider λ to be a connected graph with vertex set id="M2"> V that may partitioned into any partition id="M3"> S . If each in id="M4"> has separate representation regard id="M5"> and is an ordered id="M6"> k partition, then the id="M7"> resolving of id="M8"> . A dimension id="M9"> , represented by id="M10"> p d minimal cardinality id="M11"> partitions id="M12"> The various generalised families graphs, such as Harary graph, Cayley Pendent given sharp upper bound this article.
منابع مشابه
On Generalised Fuzzy Graph Structures
In this paper, the concept of a fuzzy graph structure is introduced based on the concept of graph structure given by E. Sampathkumar, in Bull. Kerala Math. Assoc., Vol 3, No.2 (2006 December), 65123. New concepts like ρi − edge, ρi − path, ρi − cycle, ρi − tree, ρi − forest, fuzzy ρi − cycle, fuzzy ρi − tree, fuzzy ρi − forest etc. are introduced. Some results are obtained. We continue the stud...
متن کاملSome Results on Discrepancies between Metric Dimension and Partition Dimension of a Graph*
SOME RESULTS ON DISCREPANCIES BETWEEN METRIC DIMENSION AND PARTITION DIMENSION OF A GRAPH* Muhammad Imran Centre for Advanced Mathematics and Physics, National University of Sciences and Technology, Sector H-12, Islamabad, Pakistan [email protected] ABSTRACT. In this paper some infinite regular graphs generated by tilings of the plane by infinite hexagonal grid are considered. It is prove...
متن کاملthe role of task-based techniques on the acquisition of english language structures by the intermediate efl students
this study examines the effetivenss of task-based activities in helping students learn english language structures for a better communication. initially, a michigan test was administered to the two groups of 52 students majoring in english at the allameh ghotb -e- ravandi university to ensure their homogeneity. the students scores on the grammar part of this test were also regarded as their pre...
15 صفحه اولOn the Connected Partition Dimension of a Wheel Related Graph
Let G be a connected graph. For a vertex v ∈ V (G) and an ordered k-partition Π = {S1, S2, ..., Sk} of V (G), the representation of v with respect to Π is the k-vector r(v|Π) = (d(v, S1), d(v, S2), ..., d(v, Sk)), where d(v, Si) denotes the distance between v and Si. The k-partition Π is said to be resolving if the k-vectors r(v|Π), v ∈ V (G), are distinct. The minimum k for which there is a re...
متن کاملOn the partition dimension and connected partition dimension of wheels
Let G be a connected graph. For a vertex v ∈ V (G) and an ordered k-partition Π = {S1, S2, ..., Sk} of V (G), the representation of v with respect to Π is the k-vector r(v|Π) = (d(v, S1), d(v, S2), ..., d(v, Sk)). The k-partition Π is said to be resolving if the k-vectors r(v|Π), v ∈ V (G), are distinct. The minimum k for which there is a resolving k-partition of V (G) is called the partition d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2022
ISSN: ['2314-4785', '2314-4629']
DOI: https://doi.org/10.1155/2022/9531182